TSTP Solution File: SET907^7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET907^7 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:56:28 EDT 2024
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 29
% Syntax : Number of formulae : 57 ( 28 unt; 18 typ; 0 def)
% Number of atoms : 135 ( 17 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 416 ( 64 ~; 44 |; 7 &; 291 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 74 ( 74 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 86 ( 48 ^ 38 !; 0 ?; 86 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_22,type,
qmltpeq: mu > mu > $i > $o ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_36,type,
exists_in_world: mu > $i > $o ).
thf(decl_37,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_58,type,
subset: mu > mu > $i > $o ).
thf(decl_59,type,
in: mu > mu > $i > $o ).
thf(decl_60,type,
unordered_pair: mu > mu > mu ).
thf(decl_61,type,
set_union2: mu > mu > mu ).
thf(decl_65,type,
esk4_0: $i ).
thf(decl_66,type,
esk5_0: mu ).
thf(decl_67,type,
esk6_0: mu ).
thf(decl_68,type,
esk7_0: mu ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mimplies) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X11: mu > $i > $o,X3: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ X3 )
=> ( X11 @ X12 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mvalid) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mand @ ( mimplies @ X4 @ X5 ) @ ( mimplies @ X5 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mequiv) ).
thf(t48_zfmisc_1,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] :
( mforall_ind
@ ^ [X30: mu] : ( mimplies @ ( mand @ ( in @ X28 @ X29 ) @ ( in @ X30 @ X29 ) ) @ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X28 @ X30 ) @ X29 ) @ X29 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_zfmisc_1) ).
thf(t12_xboole_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] : ( mimplies @ ( subset @ X28 @ X29 ) @ ( qmltpeq @ ( set_union2 @ X28 @ X29 ) @ X29 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
thf(existence_of_unordered_pair_ax,axiom,
! [X7: $i,X20: mu,X21: mu] : ( exists_in_world @ ( unordered_pair @ X20 @ X21 ) @ X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_unordered_pair_ax) ).
thf(t38_zfmisc_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] :
( mforall_ind
@ ^ [X30: mu] : ( mequiv @ ( subset @ ( unordered_pair @ X28 @ X29 ) @ X30 ) @ ( mand @ ( in @ X28 @ X30 ) @ ( in @ X29 @ X30 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
thf(c_0_11,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_15,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_16,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_12]),c_0_13]) ).
thf(c_0_17,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ Z1 )
=> ( Z0 @ X12 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_18,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_19,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv]) ).
thf(c_0_20,negated_conjecture,
~ ! [X129: $i,X128: mu] :
( ( exists_in_world @ X128 @ X129 )
=> ! [X127: mu] :
( ( exists_in_world @ X127 @ X129 )
=> ! [X126: mu] :
( ( exists_in_world @ X126 @ X129 )
=> ( ~ ~ ( ~ ( in @ X128 @ X127 @ X129 )
| ~ ( in @ X126 @ X127 @ X129 ) )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X128 @ X126 ) @ X127 ) @ X127 @ X129 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t48_zfmisc_1])]),c_0_15]),c_0_16]),c_0_17]),c_0_18])]) ).
thf(c_0_21,plain,
! [X121: $i,X120: mu] :
( ( exists_in_world @ X120 @ X121 )
=> ! [X119: mu] :
( ( exists_in_world @ X119 @ X121 )
=> ( ~ ( subset @ X120 @ X119 @ X121 )
| ( qmltpeq @ ( set_union2 @ X120 @ X119 ) @ X119 @ X121 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[t12_xboole_1]),c_0_16]),c_0_17]),c_0_18])]) ).
thf(c_0_22,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_15]),c_0_16]) ).
thf(c_0_23,negated_conjecture,
( ( exists_in_world @ esk5_0 @ esk4_0 )
& ( exists_in_world @ esk6_0 @ esk4_0 )
& ( exists_in_world @ esk7_0 @ esk4_0 )
& ( in @ esk5_0 @ esk6_0 @ esk4_0 )
& ( in @ esk7_0 @ esk6_0 @ esk4_0 )
& ~ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ esk5_0 @ esk7_0 ) @ esk6_0 ) @ esk6_0 @ esk4_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
thf(c_0_24,plain,
! [X214: $i,X215: mu,X216: mu] :
( ~ ( exists_in_world @ X215 @ X214 )
| ~ ( exists_in_world @ X216 @ X214 )
| ~ ( subset @ X215 @ X216 @ X214 )
| ( qmltpeq @ ( set_union2 @ X215 @ X216 ) @ X216 @ X214 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
thf(c_0_25,plain,
! [X139: $i,X140: mu,X141: mu] : ( exists_in_world @ ( unordered_pair @ X140 @ X141 ) @ X139 ),
inference(variable_rename,[status(thm)],[existence_of_unordered_pair_ax]) ).
thf(c_0_26,plain,
! [X125: $i,X124: mu] :
( ( exists_in_world @ X124 @ X125 )
=> ! [X123: mu] :
( ( exists_in_world @ X123 @ X125 )
=> ! [X122: mu] :
( ( exists_in_world @ X122 @ X125 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X124 @ X123 ) @ X122 @ X125 )
| ~ ( ~ ( in @ X124 @ X122 @ X125 )
| ~ ( in @ X123 @ X122 @ X125 ) ) )
| ~ ( ~ ~ ( ~ ( in @ X124 @ X122 @ X125 )
| ~ ( in @ X123 @ X122 @ X125 ) )
| ( subset @ ( unordered_pair @ X124 @ X123 ) @ X122 @ X125 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[t38_zfmisc_1]),c_0_15]),c_0_22]),c_0_17]),c_0_18])]) ).
thf(c_0_27,negated_conjecture,
~ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ esk5_0 @ esk7_0 ) @ esk6_0 ) @ esk6_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_28,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( qmltpeq @ ( set_union2 @ X10 @ X12 ) @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( subset @ X10 @ X12 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_29,negated_conjecture,
exists_in_world @ esk6_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_30,plain,
! [X12: mu,X10: mu,X3: $i] : ( exists_in_world @ ( unordered_pair @ X10 @ X12 ) @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_31,plain,
! [X217: $i,X218: mu,X219: mu,X220: mu] :
( ( ( in @ X218 @ X220 @ X217 )
| ~ ( subset @ ( unordered_pair @ X218 @ X219 ) @ X220 @ X217 )
| ~ ( exists_in_world @ X220 @ X217 )
| ~ ( exists_in_world @ X219 @ X217 )
| ~ ( exists_in_world @ X218 @ X217 ) )
& ( ( in @ X219 @ X220 @ X217 )
| ~ ( subset @ ( unordered_pair @ X218 @ X219 ) @ X220 @ X217 )
| ~ ( exists_in_world @ X220 @ X217 )
| ~ ( exists_in_world @ X219 @ X217 )
| ~ ( exists_in_world @ X218 @ X217 ) )
& ( ~ ( in @ X218 @ X220 @ X217 )
| ~ ( in @ X219 @ X220 @ X217 )
| ( subset @ ( unordered_pair @ X218 @ X219 ) @ X220 @ X217 )
| ~ ( exists_in_world @ X220 @ X217 )
| ~ ( exists_in_world @ X219 @ X217 )
| ~ ( exists_in_world @ X218 @ X217 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])]) ).
thf(c_0_32,negated_conjecture,
~ ( subset @ ( unordered_pair @ esk5_0 @ esk7_0 ) @ esk6_0 @ esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
thf(c_0_33,plain,
! [X12: mu,X14: mu,X10: mu,X3: $i] :
( ( subset @ ( unordered_pair @ X10 @ X14 ) @ X12 @ X3 )
| ~ ( in @ X10 @ X12 @ X3 )
| ~ ( in @ X14 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X14 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_34,negated_conjecture,
in @ esk7_0 @ esk6_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_35,negated_conjecture,
in @ esk5_0 @ esk6_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_36,negated_conjecture,
exists_in_world @ esk7_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_37,negated_conjecture,
exists_in_world @ esk5_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]),c_0_36]),c_0_29]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET907^7 : TPTP v8.2.0. Released v5.5.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n014.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 12:28:38 EDT 2024
% 0.15/0.30 % CPUTime :
% 0.15/0.40 Running higher-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.43 # Version: 3.1.0-ho
% 0.15/0.43 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.15/0.43 # Starting post_as_ho3 with 300s (1) cores
% 0.15/0.43 # Starting new_ho_12 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_2 with 300s (1) cores
% 0.15/0.43 # post_as_ho3 with pid 9512 completed with status 0
% 0.15/0.43 # Result found by post_as_ho3
% 0.15/0.43 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.15/0.43 # Starting post_as_ho3 with 300s (1) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: HHHNM-FFMS21-SHSSMFNN
% 0.15/0.43 # partial match(2): HHHNM-FFSF21-SHSSMFNN
% 0.15/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting new_ho_10 with 163s (1) cores
% 0.15/0.43 # new_ho_10 with pid 9517 completed with status 0
% 0.15/0.43 # Result found by new_ho_10
% 0.15/0.43 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.15/0.43 # Starting post_as_ho3 with 300s (1) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: HHHNM-FFMS21-SHSSMFNN
% 0.15/0.43 # partial match(2): HHHNM-FFSF21-SHSSMFNN
% 0.15/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting new_ho_10 with 163s (1) cores
% 0.15/0.43 # Preprocessing time : 0.002 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 103
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 80
% 0.15/0.43 # Removed in clause preprocessing : 41
% 0.15/0.43 # Initial clauses in saturation : 39
% 0.15/0.43 # Processed clauses : 81
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 2
% 0.15/0.43 # ...remaining for further processing : 79
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 40
% 0.15/0.43 # ...of the previous two non-redundant : 33
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 40
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 58
% 0.15/0.43 # ...of those cached : 36
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 40
% 0.15/0.43 # Positive orientable unit clauses : 12
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 5
% 0.15/0.43 # Non-unit-clauses : 23
% 0.15/0.43 # Current number of unprocessed clauses: 30
% 0.15/0.43 # ...number of literals in the above : 152
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 39
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 536
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 170
% 0.15/0.43 # Non-unit clause-clause subsumptions : 4
% 0.15/0.43 # Unit Clause-clause subsumption calls : 2
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 0
% 0.15/0.43 # BW rewrite match successes : 0
% 0.15/0.43 # Condensation attempts : 81
% 0.15/0.43 # Condensation successes : 2
% 0.15/0.43 # Termbank termtop insertions : 12427
% 0.15/0.43 # Search garbage collected termcells : 4747
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.014 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.017 s
% 0.15/0.43 # Maximum resident set size: 2648 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.019 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.022 s
% 0.15/0.43 # Maximum resident set size: 1848 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------